全文获取类型
收费全文 | 267篇 |
免费 | 94篇 |
国内免费 | 10篇 |
出版年
2023年 | 4篇 |
2022年 | 7篇 |
2021年 | 5篇 |
2020年 | 11篇 |
2019年 | 3篇 |
2018年 | 8篇 |
2017年 | 16篇 |
2016年 | 20篇 |
2015年 | 15篇 |
2014年 | 23篇 |
2013年 | 24篇 |
2012年 | 21篇 |
2011年 | 24篇 |
2010年 | 13篇 |
2009年 | 18篇 |
2008年 | 18篇 |
2007年 | 19篇 |
2006年 | 22篇 |
2005年 | 24篇 |
2004年 | 16篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 10篇 |
2000年 | 13篇 |
1999年 | 7篇 |
1998年 | 10篇 |
1995年 | 2篇 |
1994年 | 1篇 |
1991年 | 1篇 |
排序方式: 共有371条查询结果,搜索用时 31 毫秒
21.
We consider the problem of scheduling customer orders in a flow shop with the objective of minimizing the sum of tardiness, earliness (finished goods inventory holding), and intermediate (work‐in‐process) inventory holding costs. We formulate this problem as an integer program, and based on approximate solutions to two different, but closely related, Dantzig‐Wolfe reformulations, we develop heuristics to minimize the total cost. We exploit the duality between Dantzig‐Wolfe reformulation and Lagrangian relaxation to enhance our heuristics. This combined approach enables us to develop two different lower bounds on the optimal integer solution, together with intuitive approaches for obtaining near‐optimal feasible integer solutions. To the best of our knowledge, this is the first paper that applies column generation to a scheduling problem with different types of strongly ????‐hard pricing problems which are solved heuristically. The computational study demonstrates that our algorithms have a significant speed advantage over alternate methods, yield good lower bounds, and generate near‐optimal feasible integer solutions for problem instances with many machines and a realistically large number of jobs. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004. 相似文献
22.
为了满足多智能体应急反应仿真的需求,首先对构建多智能体应急反应仿真模拟框架的复杂性进行了分析,在此基础上提出并设计了组件式仿真模拟框架.采用本体(Ontology)建模、语义网模型及产生式规则推理等理论方法构建了仿真模拟框架的场景建模模块、人员Agent建模模块等组件.最后对依照上述研究内容所开发的原型系统进行了测试,对测试结果进行了分析,结果表明该框架能够有效满足多智能体应急反应仿真的建模需求. 相似文献
23.
The ability to cope with uncertainty in dynamic scheduling environments is becoming an increasingly important issue. In such environments, any disruption in the production schedule will translate into a disturbance of the plans for several external activities as well. Hence, from a practical point of view, deviations between the planned and realized schedules are to be avoided as much as possible. The term stability refers to this concern. We propose a proactive approach to generate efficient and stable schedules for a job shop subject to processing time variability and random machine breakdowns. In our approach, efficiency is measured by the makespan, and the stability measure is the sum of the variances of the realized completion times. Because the calculation of the original measure is mathematically intractable, we develop a surrogate stability measure. The version of the problem with the surrogate stability measure is proven to be NP‐hard, even without machine breakdowns; a branch‐and‐bound algorithm is developed for this problem variant. A tabu search algorithm is proposed to handle larger instances of the problem with machine breakdowns. The results of extensive computational experiments indicate that the proposed algorithms are quite promising in performance. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011 相似文献
24.
抢险救灾非战争军事行动包括道路抢修和物资运输等任务,而这两类任务在灾后应急资源调度中存在关联性的影响,且面临路网结构可变及需求随机模糊等挑战,对此,提出了一种非确定性应急资源调度网络双层规划模型,设计了基于蒙特卡洛方法与遗传算法耦合的智能启发式求解策略.通过对典型情境下应急资源调度案例进行分析建模和数值求解,说明了该模型和算法的合理性和有效性. 相似文献
25.
26.
In many practical manufacturing environments, jobs to be processed can be divided into different families such that a setup is required whenever there is a switch from processing a job of one family to another job of a different family. The time for setup could be sequence independent or sequence dependent. We consider two particular scheduling problems relevant to such situations. In both problems, we are given a set of jobs to be processed on a set of identical parallel machines. The objective of the first problem is to minimize total weighted completion time of jobs, and that of the second problem is to minimize weighted number of tardy jobs. We propose column generation based branch and bound exact solution algorithms for the problems. Computational experiments show that the algorithms are capable of solving both problems of medium size to optimality within reasonable computational time. © 2003 Wiley Periodicals, Inc. Naval Research Logistics 50: 823–840, 2003. 相似文献
27.
通用装备维修保障资源需求仿真建模研究 总被引:3,自引:0,他引:3
从新型通用装备维修保障的实际需求出发,在对维修保障系统运行过程分析的基础上,建立了维修资源需求的仿真模型,并给出了相关算法。该模型可实现对各种主要维修资源需求的预测,并能给出装备完好率、备件缺货率和装备待修时间等系统特征指标。该模型和算法可为装备的维修保障提供科学的依据。 相似文献
28.
研究了网格资源监控理论,介绍了端到端监控组件及LDAP协议。结合基于LDAP的资源监控模型,讨论了装备保障资源监控系统中监控对象的表示及系统的结构设计,并说明其工作机理。 相似文献
29.
针对装甲装备车务管理信息化建设过程中,出现的数据环境不适应信息化发展的问题,分析了造成数据环境混乱,形成信息孤岛的原因,提出了用信息资源规划的思想和技术对数据环境进行改造,建立车务管理的功能模型、数据模型和数据管理的基础标准,实现信息共享的方案,解决了车务管理信息化建设过程中的信息孤岛问题,为实现车务管理信息化的跨越式发展奠定了基础. 相似文献
30.
The coordination of production, supply, and distribution is an important issue in logistics and operations management. This paper develops and analyzes a single‐machine scheduling model that incorporates the scheduling of jobs and the pickup and delivery arrangements of the materials and finished jobs. In this model, there is a capacitated pickup and delivery vehicle that travels between the machine and the storage area, and the objective is to minimize the makespan of the schedule. The problem is strongly NP‐hard in general but is solvable in polynomial time when the job processing sequence is predetermined. An efficient heuristic is developed for the general problem. The effectiveness of the heuristic is studied both analytically and computationally. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献